Testing linear algebra software
نویسنده
چکیده
How can we test the correctness of a computer implementation of an algorithm such as Gaussian elimination, or the QR algorithm for the eigenproblem? This is an important question for program libraries such as LAPACK, that are designed to run on a wide range of systems. We discuss testing based on verifying known backward or forward error properties of the algorithms, with particular reference to the test software in LAPACK. Issues considered include the choice of bound to verify, computation of the backward error, and choice of test matrices. Some examples of bugs in widely used linear algebra software are described.
منابع مشابه
A Test Matrix Generation
We discuss the design and implementation of a suite of test matrix generators for testing linear algebra software. These routines generate random matrices with certain properties which are useful for testing linear equation solving, least squares, and eigendecomposition software. These properties include the spectrum, symmetry, bandwidth, norm, sparsity, conditioning (with respect to inversion ...
متن کاملLAPACK Working Note 9 A Test Matrix Generation
We discuss the design and implementation of a suite of test matrix generators for testing linear algebra software. These routines generate random matrices with certain properties which are useful for testing linear equation solving, least squares, and eigendecomposition software. These properties include the spectrum, symmetry, bandwidth, norm, sparsity, conditioning (with respect to inversion ...
متن کاملLapack Working Note 9 a T Est Matrix Generation Suite
We discuss the design and implementation of a suite of test matrix generators for testing linear algebra software. These routines generate random matrices with certain properties which are useful for testing linear equation solving, least squares, and eigendecomposition software. These properties include the spectrum, symmetry, bandwidth, norm, sparsity, conditioning (with respect to inversion ...
متن کاملCase studies on the development of ScaLAPACK and the NAG Numerical PVM Library
In this paper we look at the development of ScaLAPACK, a software library for dense and banded numerical linear algebra, and the NAG Numerical PVM Library, which includes software for dense and sparse linear algebra, quadrature, optimization and random number generation. Both libraries are aimed at distributed memory machines, including networks of workstations. The paper concentrates on the un...
متن کاملMinimal solution of fuzzy neutrosophic soft matrix
The aim of this article is to study the concept of unique solvability of max-min fuzzy neutrosophic soft matrix equation and strong regularity of fuzzy neutrosophic soft matrices over Fuzzy Neutrosophic Soft Algebra (FNSA). A Fuzzy Neutrosophic Soft Matrix (FNSM) is said to have Strong, Linear Independent (SLI) column (or, in the case of fuzzy neutrosophic soft square matrices, to be strongly r...
متن کامل